Fast Engset computation
نویسندگان
چکیده
منابع مشابه
Generalized Engset System — properties and an application
The well-known formula of Engset has since been generalized. I present some properties of these formulas, and consider an application to a dynamic multicast scheme. The existence and number of solutions of a fixed point solution of Reduced Load Approximation for end to end blocking probabilities with identical capacity requirements for each channel in a dynamic multicast scheme is studied.
متن کاملFast Local Computation Algorithms
For input x, let F (x) denote the set of outputs that are legal answers. Suppose x and members of F (x) are so large that there is not time to read them in their entirety. We propose a model of local computation algorithms which for a given input x, support queries by a user to values of specified locations yi in a legal output y ∈ F (x). When more than one legal output y exists for a given x, ...
متن کاملFast Stixel Computation for Fast Pedestrian Detection
Applications using pedestrian detection in street scene require both high speed and quality. Maximal speed is reached when exploiting the geometric information provided by stereo cameras. Yet, extracting useful information at speeds higher than 100Hz is a non-trivial task. We propose a method to estimate the ground-obstacles boundary (and its distance), without computing a depth map. By properl...
متن کاملFast Distributed PageRank Computation
Over the last decade, PageRank has gained importance in a wide range of applications and domains, ever since it first proved to be effective in determining node importance in large graphs (and was a pioneering idea behind Google’s search engine). In distributed computing alone, PageRank vectors, or more generally random walk based quantities have been used for several different applications ran...
متن کاملFast Computation of Kernel Estimators
The computational complexity of evaluating the kernel density estimate (or its derivatives) at m evaluation points given n sample points scales quadratically as O(nm)–making it prohibitively expensive for large data sets. While approximate methods like binning could speed up the computation they lack a precise control over the accuracy of the approximation. There is no straightforward way of ch...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Letters
سال: 2016
ISSN: 0167-6377
DOI: 10.1016/j.orl.2016.02.011